#include"DoubleTree.h"

void test_01()
{
	char arr[] = "ABD##E#H##CF##G##";
	int i = 0;
	int* pi = &i;
	Node* root = BinaryTreeCreate(arr, sizeof(arr), pi);

	printf("%d\n", BinaryTreeSize(root));
	printf("%d\n", BinaryTreeLeafSize(root));
	printf("%d\n", BinaryTreeLevelKSize(root, 4));
	printf("%c\n", BinaryTreeFind(root, 'H')->date);

	BinaryTreePrevOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");

	BinaryTreePostOrder(root);
	printf("\n");

	BinaryTreeLevelOrder(root);
	printf("\n");
	printf("%d ", BinaryTreeComplete(root));

	BinaryTreeDestory(&root);

}


int main()
{
	test_01();

	return 0;
}
